Divided we stand: Parallel distributed stack memory management

We present an overview of the stack-based memory management techniques that we used in our non-deterministic and-parallel Prolog systems: &-Prolog and DASWAM. We believe that the problems associated with non-deterministic and-parallel systems are more general than those encountered in or-parallel and deterministic and-parallel systems, which can be seen as subsets of this more general case. We develop on the previously proposed "marker scheme", lifting some of the restrictions associated with the selection of goals while keeping (virtual) memory consumption down. We also review some of the other problems associated with the stack-based management scheme, such as handling of forward and backward execution, cut, and roll-backs

Lower-bound Time-Complexity Analysis of Logic Programs

The paper proposes a technique for inferring conditions on goals that, when satisfied, ensure that a goal is sufficiently coarse-grained to warrant parallel evaluation. The method is powerful enough to reason about divide-and-conquer programs, and in the case of quicksort, for instance, can infer that a quicksort goal has a time complexity that exceeds 64 resolution steps (a threshold for spawning) if the input list is of length 10 or more. This gives a simple run-time tactic for controlling spawning. The method has been proved correct, can be implemented straightforwardly, has been demonstrated to be useful on a parallel machine, and, in contrast with much of the previous work on time-complexity analysis of logic programs, does not require any complicated difference equation solving machinery

Flexible scheduling for non-deterministic, and-parallel execution of logic programs

Abstract is not available

A proposal for a flexible scheduling and memory management scheme for non-deterministic, andparallel execution of logic programs

In this paper, we examine the issue of memory management in the parallel execution of logic programs. We concentrate on non-deterministic and-parallel schemes which we believe present a relatively general set of problems to be solved, including most of those encountered in the memory management of or-parallel systems. We present a distributed stack memory management model which allows flexible scheduling of goals. Previously proposed models (based on the "Marker model") are lacking in that they impose restrictions on the selection of goals to be executed or they may require consume a large amount of virtual memory. This paper first presents results which imply that the above mentioned shortcomings can have significant performance impacts. An extension of the Marker Model is then proposed which allows flexible scheduling of goals while keeping (virtual) memory consumption down. Measurements are presented which show the advantage of this solution. Methods for handling forward and backward execution, cut and roll back are discussed in the context of the proposed scheme. In addition, the paper shows how the same mechanism for flexible scheduling can be applied to allow the efficient handling of the very general form of suspension that can occur in systems which combine several types of and-parallelism and more sophisticated methods of executing logic programs. We believe that the results are applicable to many and- and or-parallel systems

A simulation study of or- and independent and-parallelism

Although studies of a number of parallel implementations of logic programming languages are now available, the results are difficult to interpret due to the multiplicity of factors involved, the effect of each of which is difficult to sepárate. In this paper we present the results of a highlevel simulation study of or- and independent and-parallelism with a wide selection of Prolog programs that aims to facilítate this separation. We hope this study will be instrumental in better understanding and comparing results from actual implementations, as shown by an example in the paper. In addition, the paper examines some of the issues and tradeoffs associated with the combination of and- and or-parallelism and proposes reasonable solutions based on the simulation data

Ramsey-like measurement of the decoherence rate between Zeeman sub-levels

Two-photon processes that involve different sub-levels of the ground state of an atom, are highly sensitive to depopulation and decoherence within the ground state. For example, the spectral width of electromagnetically induced transparency resonances in $\Lambda-$type system, are strongly affected by the ground state depopulation and decoherence rates. We present a direct measurement of decay rates between hyperfine and Zeeman sub-levels in the ground state of $^{87}$Rb vapor. Similar to the relaxation-in-the-dark technique, pumping lasers are used to pre-align the atomic vapor in a well defined quantum state. The free propagation of the atomic state is monitored using a Ramsey-like method. Coherence times in the range 1-10 ms were measured for room temperature atomic vapor. In the range of the experimental parameters used in this study, the dominant process inducing Zeeman decoherence is the spin-exchange collisions between rubidium atoms.Comment: 7 pages, 7 figure

High-level characteristics of or-and independent and-parallelism in prolog

Although studies of a number of parallel implementations of logic programming languages are now available, their results are difficult to interpret due to the multiplicity of factors involved, the effect of each of which is difficult to sepárate. In this paper we present the results of a high-level simulation study of or- and independent and-parallelism with a wide selection of Prolog programs that aims to determine the intrinsic amount of parallelism, independently of implementation factors, thus facilitating this separation. We expect this study will be instrumental in better understanding and comparing results from actual implementations, as shown by some examples provided in the paper. In addition, the paper examines some of the issues and tradeoffs associated with the combination of and- and or-parallelism and proposes reasonable solutions based on the simulation data obtained

Matrix Recruitment and Calcium Sequestration for Spatial Specific Otoconia Development

Otoconia are bio-crystals anchored to the macular sensory epithelium of the utricle and saccule in the inner ear for motion sensing and bodily balance. Otoconia dislocation, degeneration and ectopic calcification can have detrimental effects on balance and vertigo/dizziness, yet the mechanism underlying otoconia formation is not fully understood. In this study, we show that selected matrix components are recruited to form the crystal matrix and sequester Ca2+ for spatial specific formation of otoconia. Specifically, otoconin-90 (Oc90) binds otolin through both domains (TH and C1q) of otolin, but full-length otolin shows the strongest interaction. These proteins have much higher expression levels in the utricle and saccule than other inner ear epithelial tissues in mice. In vivo, the presence of Oc90 in wildtype (wt) mice leads to an enrichment of Ca2+ in the luminal matrices of the utricle and saccule, whereas absence of Oc90 in the null mice leads to drastically reduced matrix-Ca2+. In vitro, either Oc90 or otolin can increase the propensity of extracellular matrix to calcify in cell culture, and co-expression has a synergistic effect on calcification. Molecular modeling and sequence analysis predict structural features that may underlie the interaction and Ca2+-sequestering ability of these proteins. Together, the data provide a mechanism for the otoconial matrix assembly and the role of this matrix in accumulating micro-environmental Ca2+ for efficient CaCO3 crystallization, thus uncover a critical process governing spatial specific otoconia formation

Large expert-curated database for benchmarking document similarity detection in biomedical literature search

Document recommendation systems for locating relevant literature have mostly relied on methods developed a decade ago. This is largely due to the lack of a large offline gold-standard benchmark of relevant documents that cover a variety of research fields such that newly developed literature search techniques can be compared, improved and translated into practice. To overcome this bottleneck, we have established the RElevant LIterature SearcH consortium consisting of more than 1500 scientists from 84 countries, who have collectively annotated the relevance of over 180 000 PubMed-listed articles with regard to their respective seed (input) article/s. The majority of annotations were contributed by highly experienced, original authors of the seed articles. The collected data cover 76% of all unique PubMed Medical Subject Headings descriptors. No systematic biases were observed across different experience levels, research fields or time spent on annotations. More importantly, annotations of the same document pairs contributed by different scientists were highly concordant. We further show that the three representative baseline methods used to generate recommended articles for evaluation (Okapi Best Matching 25, Term Frequency–Inverse Document Frequency and PubMed Related Articles) had similar overall performances. Additionally, we found that these methods each tend to produce distinct collections of recommended articles, suggesting that a hybrid method may be required to completely capture all relevant articles. The established database server located at https://relishdb.ict.griffith.edu.au is freely available for the downloading of annotation data and the blind testing of new methods. We expect that this benchmark will be useful for stimulating the development of new powerful techniques for title and title/abstract-based search engines for relevant articles in biomedical research